| 1. | Solves the most short - path using the dynamic programming algorithm
利用动态规划算法求解最短路径 |
| 2. | Dynamic programming algorithm of bottleneck transportation problem based on entropy
基于熵的瓶颈运输问题的动态规划解 |
| 3. | Dynamic programming algorithm of m - dimensional bottleneck assignment problem based on entropy
维瓶颈指派问题的动态规划解 |
| 4. | In this paper , a new dynamic programming algorithm for unconstrained 2d stock cutting problem is presented
摘要本文给出了一种求解无限制板材下料问题的动态规划解法，对该算法的计算复杂度进行了分析。 |
| 5. | This paper is to establish a system based on electronic map for motorcade - optimized dispatching , and dynamic programming algorithm is used to realize vehicle dispatching
本文的中心内容是：组建了一个基于电子地图大型车队优化调度及管理系统，并用动态规划算法实现了车辆的智能调度。 |
| 6. | 4 . design the optimal loiter trajectory of the attack uav in the horizontal plane using maximum principle and desige the loiter strategy of the attack uav using dynamic programming algorithm and game theory . 5
运用最大值原理对待机搜索段进行优化设计，并且应用博弈论、动态规划方法对搜索策略进行设计，提高了无人机使用效率和作战效能。 |
| 7. | Abstract to increase the storage capacity of mobile equipment and improve the transmission efficiency of vector data on network , this paper proposed a model and improved method of vector data compression based on dynamic programming algorithm
摘要为了使移动设备存储大容量的矢量数据和提高矢量数据的网络传输效率，矢量数据压缩是一项很重要的工作。 |
| 8. | In the algorithm , a search tree with roots of the cumulative demands in the corresponding period is taken as the roots of the search tree , transforming the quantity discount problem into dynamic order quantity ( doq ) problem that is solvable with a dynamic programming algorithm
该算法以各时段的累计需求为根节点建立搜索树，从而将带折扣的库存问题转化为典型的动态批量问题，运用动态规划法即可求解。 |
| 9. | Basing on studying the principle of active contour model and some solutions to it , a new partial optimal dynamic programming contour detection algorithm is presented and the results comparable to the dynamic programming algorithm are given
在研究动态轮廓模型原理及其求解算法的基础上提出了一种新的部分最优化动态规划轮廓检测算法，保留了动态规划算法的性能和优点，但综合运算复杂度降低，运算速度大大提高。 |
| 10. | As more and more genome sequencing projects are accomplished one after another , the amount of sequence data has been exponentially increased , the demand for efficient alignment algorithm in sequence analysis is increasingly urgent . based on the concept of sequence segmentation , we applied the multiple - stage dynamic programming algorithm in pairwise alignment to devise a new algorithm named samidp and developed the corresponding programs in visualbasic , we find that samidp not only reduces the computation complexity to o ( n ) , but also obtains even satisfactory accuracy , and it is expected that the new algorithm will be important in global sequence alignment
基于段与段比对的概念，我们设计了一个用于核酸序列全局比对的新算法samidp ( sequencealignmentbasedonmultiplestageintelligentdynamicprogrammingalgorithm ) ，将多阶段动态规划决策算法用于两两序列比对并用visualbasic编程实现，结果发现该新算法在将计算复杂度减小到o ( n )的同时，也能够获得较为理想的计算精度，预期将在序列全局比对中起重要作用。 |
